A convex Hull algorithm for solving a location problem
نویسندگان
چکیده
A problem in distance geometry is to find the location of an unknown point in a given convex set in Rk such that its farthest distance to n fixed points is minimum. In this paper we present an algorithm based on subgradient method and convex hull computation for solving this problem. A recent improvement of Quickhull algorithm for computing the convex hull of a finite set of planar points is applied to fasten up computation in our numerical experiments.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملModified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملSolution of Backup Multifacility Location Problem by Considering the Ideal Radius for each Customer
In this paper we introduce a new facility location model, called backup multifacility location problem by considering the ideal radius for each customer. In this problem the location of clients are given in the plane. A radius is assigned to each client. We should find the location of new facilities, which some of them may fail with a given probability, such that the sum of weighted distances f...
متن کاملSolving Constrained Two-facility Location Problems
A general approach to optimally solve multiple facility location problems based on the “Big Triangle Small Triangle” approach to solving single facility problems is proposed. The proposed procedure is especially effective when the solution is constrained to a given polygon such as the convex hull of demand points. The procedure is tested on the two facilities Weber problem with attraction and r...
متن کاملA firefly algorithm for solving competitive location-design problem: a case study
This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RAIRO - Operations Research
دوره 49 شماره
صفحات -
تاریخ انتشار 2015